Decentralized network connection preemption algorithms
نویسندگان
چکیده
منابع مشابه
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, or when the network experiences link or node failures. Coupled Ž . with the capability to reroute connections preempted due to failure or preemption , connection preemption allows a high quality of service to be provide...
متن کاملConnection Preemption: Issues, Algorithms, and a Simulation Study
Connection preemption can be a means to provide available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, or when the network experiences link or node failures. We present a simulation study of preemption in a general connection-oriented network setting. Based on the observations made in this study, we have...
متن کاملConnection Preemption in Multi-Class Networks
We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize the total preempted bandwidth, in that order. We show that this problem is NP-complete by reducing it to a well-known NP complete problem – the subset sum problem. Therefore, a known polynomial time algorithm, such as Min...
متن کاملDecentralized algorithms for sequential network time synchronization
Accurate clock synchronization is important in many distributed applications. Standard algorithms, such as the Network Time Protocol (NTP), essentially rely on pairwise offset estimation between adjacent nodes. Some recent work introduced more elaborate algorithms for clock offset estimation, which take into account the algebraic constraints imposed on the sum of offsets over network cycles, us...
متن کاملPredictable Spin Lock Algorithms with Preemption
Both predictable interprocessor synchronization and fast interrupt response are required for real-time systems constructed using asymmetric shared-memory multiprocessors. This paper points out the problem that conventional spin lock algorithms cannot satisfy both requirements at the same time. To solve this problem, we have proposed an algorithm which is an extension of queueing spin locks modi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Networks and ISDN Systems
سال: 1998
ISSN: 0169-7552
DOI: 10.1016/s0169-7552(97)00139-6